Thinning a Triangulation of a Bayesian Network or Undirected Graph to Create a Minimal Triangulation
نویسندگان
چکیده
منابع مشابه
On a vertex-minimal triangulation of RP
We give three constructions of a vertex-minimal triangulation of 4-dimensional real projective space RP4. The first construction describes a 4-dimensional sphere on 32 vertices, which is a double cover of a triangulated RP4 and has a large amount of symmetry. The second and third constructions illustrate approaches to improving the known number of vertices needed to triangulate n-dimensional re...
متن کاملA Minimal Irreducible Triangulation of S3
We present a very symmetric triangulation of the 3-sphere, where every edge is in at most five facets but which is not the boundary of a polytope. This shows that not every triangulation of a sphere, where angles around faces of codimension two are less than 2π in the metric pieced together by regular Euclidean simplices, is polytopal. The counterexample presented here is the smallest triangula...
متن کاملcient Implementation of a Minimal Triangulation Algorithm
LB-triang, an algorithm for computing minimal triangulations of graphs, was presented by Berry in 1999 [1], and it gave a new characterization of minimal triangulations. The time complexity was conjectured to be O(nm), but this has remained unproven until our result. In this paper we present and prove an O(nm) time implementation of LB-triang, and we call the resulting algorithm LB-treedec. The...
متن کاملAn Evolutionary Algorithm for Bayesian Network Triangulation
The problem of triangulation (decomposition) of Bayesian networks is considered. Triangularity of a Bayesian network is required in a general evidence propagation scheme on this network. Finding an optimal triangulation is NP-hard. A local search heuristic based on the idea of evolutionary algorithms is presented. The results obtained using existing and proposed approaches are compared on a bas...
متن کاملA novel triangulation procedure for thinning hand-written text
This paper describes a novel procedure for thinning binary text images by generating graphical representations of words within the image. A smoothed polygonal approximation of the boundaries of each word is ®rst decomposed into a set of contiguous triangles. Each triangle is then classi®ed into one of only three possible types from which a graph is generated that represents the topological feat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
سال: 2017
ISSN: 0218-4885,1793-6411
DOI: 10.1142/s0218488517500143